Weights in block iterative methods
نویسندگان
چکیده مقاله:
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibilityproblems, we give equivalency of our algorithms with sequential and simultaneous block Kaczmarzmethods explaining the optimal weights have been inherently used in Kaczmarz methods. In addi-tion, a convergence result is presented for simultaneous block Kaczmarz for the case of inconsistentlinear system of equations.
منابع مشابه
weights in block iterative methods
in this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.when the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. additionally for linear feasibil...
متن کاملIntelligent Block Iterative Methods 1
SUMMARY We present several preconditioned conjugate gradient methods for the iterative solution of the linear, symmetric systems of equations arising from the nite element method in displacement form, both for the h-version and the p-version. The preconditioners are based on a decomposition of the solution space into overlapping subspaces and solving separately on each subspace. A judicious cho...
متن کاملBlock s-step Krylov iterative methods
Block (including s-step) iterative methods for (non)symmetric linear systems have been studied and implemented in the past. In this article we present a (combined) block s-step Krylov iterative method for nonsymmetric linear systems. We then consider the problem of applying any block iterative method to solve a linear system with one right-hand side using many linearly independent initial resid...
متن کاملAsynchronous block-iterative primal-dual decomposition methods for monotone inclusions
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Determinist...
متن کاملDirect and Iterative Methods for Block Tridiagonal Linear Systems
Block tridiagonal systems of linear equations occur frequently in scientific computations, often forming the core of more complicated problems. Numerical methods for solution of such systems are studied with emphasis on efficient methods for a vector computer. A convergence theory for direct methods under conditions of block diagonal dominance is developed, demonstrating stability, convergence ...
متن کاملMulticore Performance of Block Algebraic Iterative Reconstruction Methods
Algebraic iterative methods are routinely used for solving the ill-posed sparse linear systems arising in tomographic image reconstruction. Here we consider the Algebraic Reconstruction Techniques (ART) and the Simultaneous Iterative Reconstruction Techniques (SIRT), both of which rely on semi-convergence. Block versions of these methods, based on a partitioning of the linear system, are able t...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 5 شماره 2
صفحات 37- 49
تاریخ انتشار 2014-07-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023